Coevolutionary Dynamics in a Minimal Substrate

One of the central difficulties of coevolutionary methods arises from 'intransitive superiority' - in a two-player game, for example, the fact that A beats B, and B beats C, does not exclude the possibility that C beats A. Such cyclic superiority in a coevolutionary substrate is hypothesized to cause cycles in the dynamics of the population such that it 'chases its own tail' - traveling through some part of strategy space more than once despite apparent improvement with each step. It is often difficult to know whether an application domain contains such difficulties and to verify this hypothesis in the failure of a given coevolutionary set-up. In this paper we wish to elucidate some of the issues and concepts in an abstract domain where the dynamics of coevolution can be studied simply and directly. We define three simple 'number games' that illustrate intransitive superiority and resultant oscillatory dynamics, as well as some other relevant concepts. These include the distinction between a player's perceived performance and performance with respect to an external metric, and the significance of strategies with a multi-dimensional nature. These features alone can also cause oscillatory behavior and coevolutionary failure

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets

In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincar\'e characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one. We also give algorithms for obtaining semi-algebraic descriptions of the semi-algebraically connected components of any given real algebraic or semi-algebraic set in single-exponential time improving on previous results

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of $s$ polynomials in $\R[X_1,...,X_k]$ whose degrees are at most $d$ is bounded by $$\frac{(2d)^k}{k!}s^k + O(s^{k-1}).$$ This improves the best upper bound known previously which was $${1/2}\frac{(8d)^k}{k!}s^k + O(s^{k-1}).$$ The new bound matches asymptotically the lower bound obtained for families of polynomials each of which is a product of generic polynomials of degree one.Comment: 19 pages. Bibliography has been updated and a few more references have been added. This is the final version of this paper which will appear in Combinatoric

Mutualism, Parasitism, and Evolutionary Adaptation

Our investigations concern the role of symbiosis as an enabling mechanism in evolutionary adaptation. Previous work has illustrated how the formation of mutualist groups can guide genetic variation so as to enable the evolution of ultimately independent organisms that would otherwise be unobtainable. The new experiments reported here show that this effect applies not just in genetically related organisms but may also occur from symbiosis between distinct species. In addition, a new detail is revealed: when the symbiotic group members are drawn from two separate species only one of these species achieves eventual independence and the other remains parasitic. It is nonetheless the case that this second species, formerly mutualistic, was critical in enabling the independence of the first. We offer a biological example that is suggestive of the effect and discuss the implications for evolving complex organisms, natural and artificial

Modeling Building Block Interdependency

The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA test problems with a structure based on building-blocks. Many of these problems use deceptive fitness functions to model interdependency between the bits within a block. However, very few have any model of interdependency between building-blocks; those that do are not consistent in the type of interaction used intra-block and inter-block. This paper discusses the inadequacies of the various test problems in the literature and clarifies the concept of building-block interdependency. We formulate a principled model of hierarchical interdependency that can be applied through many levels in a consistent manner and introduce Hierarchical If-and-only-if (H-IFF) as a canonical example. We present some empirical results of GAs on H-IFF showing that if population diversity is maintained and linkage is tight then the GA is able to identify and manipulate building-blocks over many levels of assembly, as the Building-Block Hypothesis suggests

Stratospheric dynamics

A global circulation model is being used to study the dynamical behavior of stratospheric planetary waves (waves having horizontal wavelengths of tens of thousands of kilometers) forced by growing cyclonic disturbances of intermediate scale, typically with wavelengths of a few thousand kilometers, which occur in the troposphere. Planetary scale waves are the dominant waves in the stratosphere, and are important for understanding the distribution of atmospheric trace constituents. Planetary wave forcing by intermediate scale tropospheric cyclonic disturbances is important for producing eastward travelling planetary waves of the sort which are prominent in the Southern Hemisphere during winter. The same global circulation model is also being used to simulate and understand the rate of dispersion and possible stratospheric climatic feedbacks of the El Chichon volcanic aerosol cloud. By comparing the results of the model calculation with an established data set now in existence for the volcanic cloud spatial and temporal distribution, stratospheric transport processes will be better understood, and the extent to which the cloud modified stratospheric wind and temperature fields can be assessed

Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines

AbstractWe prove Grünbaum's conjecture that every arrangement of eight pseudolines in the projective plane is stretchable, i.e., determines a cell complex isomorphic to one determined by an arrangement of lines. The proof uses our previous results on ordered duality in the projective plane and on periodic sequences of permutations of [1,n] associated to arrangements of n lines in the euclidean plane

On the combinatorial classification of nondegenerate configurations in the plane

AbstractWe classify nondegenerate plane configurations by attaching, to each such configuration of n points, a periodic sequence of permutations of {1, 2, …, n} which satisfies some simple conditions; this classification turns out to be appropriate for questions involving convexity. In 1881 Perrin stated that every sequence satisfying these conditions was the image of some plane configuration. We show that this statement is incorrect by exhibiting a counterexample, for n = 5, and prove that for n ⩽ 5 every sequence essentially distinct from this one is realized geometrically by giving a complete classification of configurations in these cases; there is 1 combinatorial equivalence class for n = 3, 2 for n = 4, and 19 for n = 5. We develop some basic notions of the geometry of “allowable sequences” in the course of proving this classification theorem. Finally, we state some results and an open problem on the realizability question in the general case